Evidential evolving Gustafson–Kessel algorithm for online data streams partitioning using belief function theory
نویسندگان
چکیده
منابع مشابه
Evidential evolving Gustafson-Kessel algorithm for online data streams partitioning using belief function theory
A new online clustering method called E2GK (Evidential Evolving Gustafson-Kessel) is introduced. This partitional clustering algorithm is based on the concept of credal partition defined in the theoretical framework of belief functions. A credal partition is derived online by applying an algorithm resulting from the adaptation of the Evolving Gustafson-Kessel (EGK) algorithm. Online partitionin...
متن کاملE2GK: Evidential Evolving Gustafsson-Kessel Algorithm for Data Streams Partitioning Using Belief Functions
A new online clustering method, called E2GK (Evidential Evolving Gustafson-Kessel) is introduced in the theoretical framework of belief functions. The algorithm enables an online partitioning of data streams based on two existing and efficient algorithms: Evidantial cMeans (ECM) and Evolving Gustafson-Kessel (EGK). E2GK uses the concept of credal partition of ECM and adapts EGK, offering a bett...
متن کاملIntegration of Geophysical and Geological Data Using Evidential Belief Function
Several methods are available for integrating geophysical, geological, and remote sensing data sets and also for integrating them with additional information such as newly observed geophysical and geological data. Several published reports discuss successful application of different types of spatial information integration techniques including the geographical information system (GIs). There ha...
متن کاملLearning from evolving data streams: online triage of bug reports
Open issue trackers are a type of social media that has received relatively little attention from the text-mining community. We investigate the problems inherent in learning to triage bug reports from time-varying data. We demonstrate that concept drift is an important consideration. We show the effectiveness of online learning algorithms by evaluating them on several bug report datasets collec...
متن کاملBelief Function Propagation in Directed Evidential Networks
In this paper, we propose a computational data structure based on the binary join tree where the independence relations of the original directed evidential networks (DEVN) are maintained. The proposed solution uses disjunctive rule of combination (DRC) and generalized Bayesian theorem (GBT), which make possible the use of the conditional belief functions directly for reasoning in the DEVN.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2012
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2012.01.009